Erik Demaine - PDFSEARCH.IO - Document Search Engine

Erik Demaine
Results: 203

#	Item
151	Retroactive Data Structures (extended abstract) Erik D. Demaine John Iacono Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:59 Software engineering Abstract data types Data types Persistent data structure Dynamization Priority queue Binary search tree Bin Linked list Computing Data management Data structures
152	Dynamic Optimality—Almost Erik D. Demaine∗† Dion Harmon∗ John Iacono‡† Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:32 Computer programming Splay tree Tango tree Binary search tree B-tree Rope T-tree Tree R-tree Binary trees Graph theory Data management
153	Proximate Point Searching Erik D. Demaine MIT Laboratory for Computer Science, 200 Technology Square, Cambridge, MA 02139, USA. John Iacono Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:28 Estimation theory Polar coordinate system Trigonometry Triangle inequality Maximum likelihood Sine Mathematics Geometry Mathematical analysis
154	Dynamic Optimality—Almost Erik D. Demaine∗† Dion Harmon∗ Abstract Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:29 Computing Splay tree Binary search tree Tango tree T-tree B-tree Tree R-tree Rope Binary trees Graph theory Data management
155	Proximate Point Searching Erik D. Demaine∗ John Iacono† Abstract Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:28 Dimension Topology Binary trees Metric Splay tree Point location Trigonometric functions Metric space Differential geometry of surfaces Geometry Mathematics Metric geometry
156	OUTPUT-SENSITIVE ALGORITHMS FOR COMPUTING NEAREST-NEIGHBOUR DECISION BOUNDARIES∗ David Bremner† Erik Demaine‡ Pat Morin∗∗ Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:28 Computational geometry Combinatorics Delaunay triangulation Convex hull algorithms Quicksort Convex hull Boundary Euclidean minimum spanning tree Pitteway triangulation Triangulation Geometry Mathematics
157	Grid Vertex-Unfolding Orthostacks Erik D. Demaine∗ John Iacono† Abstract Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:31 Rectangle Polyhedra Polyhedron Bin Net Geometry Polygons Quadrilaterals
158	SP.268 Syllabus Melissa Gymrek (mgymrek), Jing Li (lijing) Supervisor: Erik Demaine (edemaine) Spring[removed]Course Description Add to Reading List Source URL: web.mit.edu Language: English - Date: 2011-02-01 22:38:51 Game theory Mathematical game Toy Mathematics
159	6.851: Advanced Data Structures Spring 2012 Lecture 01 — Feb 7, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:41 Computer programming Data structures B-tree Persistence Persistent data structure Linked list Binary search tree Tree traversal Pointer Binary trees Graph theory Computing
160	6.851: Advanced Data Structures Spring 2012 Lecture 17 — April 24 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-15 18:17:38 Computer programming Succinct data structure Binary tree Trie Suffix tree Bit array Implicit data structure B-tree Search tree Data structures Computing Data management

UPDATE